Irreducible elements of the copositive cone
نویسندگان
چکیده
An element A of the n× n copositive cone C is called irreducible with respect to the nonnegative cone N if it cannot be written as a nontrivial sum A = C + N of a copositive matrix C and an elementwise nonnegative matrix N . This property was studied by Baumert [2] who gave a characterisation of irreducible matrices. We demonstrate here that Baumert’s characterisation is incorrect and give a correct version of his theorem which establishes a necessary and sufficient condition for a copositive matrix to be irreducible. For the case of 5×5 copositive matrices we give a complete characterisation of all irreducible matrices. We show that those irreducible matrices in C which are not positive semidefinite can be parameterized in a semi-trigonometric way. Finally, we prove that every 5×5 copositive matrix which is not the sum of a nonnegative and a semidefinite matrix can be expressed as the sum of a nonnegative and a single irreducible matrix.
منابع مشابه
Considering copositivity locally
Let A be an element of the copositive cone COP. A zero u of A is a nonnegative vector whose elements sum up to one and such that uTAu = 0. The support of u is the index set suppu ⊂ {1, . . . , n} corresponding to the nonzero entries of u. A zero u of A is called minimal if there does not exist another zero v of A such that its support suppv is a strict subset of suppu. Our main result is a char...
متن کاملPreprint : Considering Copositivity Locally ∗
We say that a symmetric matrix A is copositive if vTAv ≥ 0 for all nonnegative vectors v. The main result of this paper is a characterization of the cone of feasible directions at a copositive matrix A, i.e., the convex cone of symmetric matrices B such that there exists δ > 0 satisfying A + δB being copositive. This cone is described by a set of linear inequalities on the elements of B constru...
متن کاملGeometry of the Copositive and Completely Positive Cones
The copositive cone, and its dual the completely positive cone, have useful applications in optimisation, however telling if a general matrix is in the copositive cone is a co-NP-complete problem. In this paper we analyse some of the geometry of these cones. We discuss a way of representing all the maximal faces of the copositive cone along with a simple equation for the dimension of each one. ...
متن کاملQuadratic factorization heuristics for copositive programming
Copositive optimization problems are particular conic programs: extremize linear forms over the copositive cone subject to linear constraints. Every quadratic program with linear constraints can be formulated as a copositive program, even if some of the variables are binary. So this is an NP-hard problem class. While most methods try to approximate the copositive cone from within, we propose a ...
متن کاملChapter 8 Copositive Programming
A symmetric matrix S is copositive if yT S y≥0 for all y≥0, and the set of all copositive matrices, denoted C∗, is a closed, pointed, convex cone; see [25] for a recent survey. Researchers have realized how to model many NP-hard optimization problems as copositive programs, that is, programs over C∗ for which the objective and all other constraints are linear [7, 9, 13, 16, 32–34]. This makes c...
متن کامل